Performing Group-By before Join

نویسندگان

  • Weipeng P. Yan
  • Per-Åke Larson
چکیده

Assume that we have an SQL query containing joins and a group by The standard way of evaluating this type of query is to rst perform all the joins and then the group by operation However it may be possible to perform the group by early that is to push the group by operation past one or more joins Early grouping may reduce the query processing cost by reducing the amount of data participating in joins We formally de ne the problem adhering strictly to the semantics of NULL and dupli cate elimination in SQL and prove necessary and su cient conditions for deciding when this transformation is valid In practice it may be ex pensive or even impossible to test whether the conditions are satis ed Therefore we also present a more practical algorithm that tests a sim pler su cient condition This algorithm is fast and detects a large sub class of transformable queries Authors email addresses fpwyan palarsong bluebox uwaterloo ca

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Processing of "GroupBy-Before-Join" Queries in Cluster Architecture

SQL queries in the real world are replete with groupby and join operations. This Qpe of queries is often known as “GroupBy-Join ” queries. In some GroupByJoin queries, it is desirable to perform group-by before join in order to achieve better performance. This subset of GroupBy-Join queries is called “GroupBy-Before-Join“ queries. In this paper, we present a study on para 1 le1 iza tion queries...

متن کامل

Parallel processing of "group-by join" queries on shared nothing machines

Abstract: SQL queries involving join and group-by operations are frequently used in many decision support applications. In these applications, the size of the input relations is usually very large, so the parallelization of these queries is highly recommended in order to obtain a desirable response time. The main drawbacks of the presented parallel algorithms that treat this kind of queries are...

متن کامل

Performance of Group Key Agreement Protocols over Multiple Operations

A few group key protocols are analyzed, implemented and deployed, but the costs associated with them have been poorly understood. Their analysis of group key agreements performance is based on the cost of performing a single operation. In this paper we extend this analysis to examine the performance behavior of five group key protocols after execution of multiple operation. We report our experi...

متن کامل

Effect of Women Led Self Help Group on Micro-Financing of Farms in Isuikwuato Local Government Area of Abia State, Nigeria

The study examined the effect of women led self help group on micro-financing of farms in Isuikwuato Local Government Area of Abia State, Nigeria. Purposive and multistage random sampling technique was employed for collecting data from one hundred and twenty (120) women farmers in women led self help group by using structured interview schedule. The data were analyzed using descriptive statisti...

متن کامل

Performance Evaluation of Parallel GroupBy-Before-Join Query Processing in High Performance Database Systems

Strategic decision making process uses a lot of GroupBy clauses and join operations queries. As the source of information in this type of application to these queries is commonly very huge, then parallelization of GroupBy-Join queries is unavoidable in order to speed up query processing time. In this paper, we investigate three parallelization techniques for GroupBy-Join queries, particularly t...

متن کامل

The automorphism group of the reduced complete-empty $X-$join of graphs

Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994